On Unimodality and Rates of Convergence for Stable Laws
نویسنده
چکیده
It is known that in the case of convergence to a normal law, the uniform rate of convergence is completely determined by the rate of convergence at points near the origin, up to terms of order n~; see [6, pp. 12, 46]. In this paper we show that results of this nature hold true for convergence to non-normal stable laws, provided the centering point is taken as the mode of the limit distribution. We concentrate on the case of a symmetric limit, which is the closest analogue of the case of normal convergence. We must stress at the outset that there are essential differences between convergence to normality and convergence to stable laws. It is shown in [7] that in certain pathological cases the rate of convergence on any compact set is faster than the uniform rate of convergence. This behaviour occurs when the tail sum function S behaves erratically towards infinity. However, it is to be hoped that if we impose regularity conditions to exclude such pathologies, then the rate of convergence on compact sets will convey considerable information about the uniform rate of convergence. We shall show in Section 3 that this is indeed the case. Very little is known about the mode of asymmetric stable laws. Indeed, it was comparatively recently [15, 20] that all stable laws were shown to be unimodal. In Section 2 we provide asymptotic formulae for the unique mode of a stable law when the law is close to being symmetric. We conjecture that not only are all stable laws unimodal, but they are also perfectly skew, in the sense that p(m — y) — p(m + y) is of the one sign for all y > 0, where p is an asymmetric stable density with mode m. Tables of asymmetric stable densities appear to support this proposition. If it is true, then the results in Section 3 can be partially extended to the asymmetric case. We close this section with notation for Section 3. Only the case of a symmetic limit is treated, although we permit the summand distribution to be asymmetric. Let Xi,X2,... be independent and identically distributed random variables in the domain of normal attraction of a stable law with exponent a, scaled and located so n that the normed sum, Sn = n~ X X}, has limit distribution function G with
منابع مشابه
Stable laws and domains of attraction in free probability theory
In this paper we determine the distributional behavior of sums of free (in the sense of Voiculescu) identically distributed, infinitesimal random variables. The theory is shown to parallel the classical theory of independent random variables, though the limit laws are usually quite different. Our work subsumes all previously known instances of weak convergence of sums of free, identically distr...
متن کاملMultiplicative strong unimodality for positive stable laws
It is known that real Non-Gaussian stable distributions are unimodal, not additive strongly unimodal, and multiplicative strongly unimodal in the symmetric case. By a theorem of Cuculescu-Theodorescu [5], the only remaining relevant situation for the multiplicative strong unimodality of stable laws is the one-sided. In this paper, we show that positive α−stable laws are multiplicative strongly ...
متن کامل[hal-00458257, v1] On the unimodality of inverse positive stable laws
We observe that the function Fα(x) = (1+αx α)e−x α is completely monotone iff α ≤ α0 for some α0 ∈ ]2/3, 3/4[. This property is equivalent to the unimodality of the inverse positive α-stable law. The random variable associated with Fα appears then in two different factorizations of the positive α-stable distribution. Furthermore, it is infinitely divisible iff α ≤ α1 for some α1 ∈ ]2/3, α0[ and...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملOn the Convergence Analysis of Gravitational Search Algorithm
Gravitational search algorithm (GSA) is one of the newest swarm based optimization algorithms, which has been inspired by the Newtonian laws of gravity and motion. GSA has empirically shown to be an efficient and robust stochastic search algorithm. Since introducing GSA a convergence analysis of this algorithm has not yet been developed. This paper introduces the first attempt to a formal conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1981